A topological order for a rectangular covering problem
نویسندگان
چکیده
We consider a rectangular covering problem, where a rectangular support P is covered by k rectangular pieces Ci, for i=1, 2, ..., k, without gaps or overlapping. We intend to cover the support P with the k pieces in a certain order so that, at the moment of the placement of the piece Ci, the northern and western borders of this piece are completely covered. Starting from a graph representation of a covering model we prove that this order is a topological order. We present a kind of topological sorting for this problem, of linear complexity. At the end we present some practical applications of this topological order. Key–Words: covering problem, topological order
منابع مشابه
The topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملA decomposition problem of a natural number for a rectangular cutting-covering model
We study in this paper a cutting-covering problem, defined by us in [2] and [3], the problem of covering a rectangular support with rectangular pieces cut from a roll. We first prove that the algorithm used in [2] and [3] for the rectangular cutting-covering problem without losses is not optimal. Starting from a decomposition of a natural number in sums of naturals we develop an algorithm for a...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملOn category of co-coverings
In this article, we introduce the concept of co-covering which is the dual of covering concept. Then, we prove several theorems being similar to the theorems that have been de-veloped for the covering concept. For example, we provide the lifting criterion for co-coverings of a topological space X, which helps us to classify them by subgroups of the group of all homeomorphisms of X.
متن کامل